The Convergence of Single-Rank Quasi-Newton Methods
نویسندگان
چکیده
منابع مشابه
The Convergence of Single - Rank Quasi - Newton Methods
Analyses of the convergence properties of general quasi-Newton methods are presented, particular attention being paid to how the approximate solutions and the iteration matrices approach their final values. It is further shown that when Broyden's algorithm is applied to linear systems, the error norms are majorised by a superlinearly convergent sequence of an unusual kind.
متن کاملOn the convergence of quasi-Newton methods for nonsmooth problems
We develop a theory of quasi-Newton and least-change update methods for solving systems of nonlinear equations F (x) = 0. In this theory, no diierentiability conditions are necessary. Instead, we assume that F can be approximated, in a weak sense, by an aane function in a neighborhood of a solution. Using this assumption, we prove local and ideal convergence. Our theory can be applied to B-diie...
متن کاملDamped techniques for enforcing convergence of quasi-Newton methods
Taylor & Francis makes every effort to ensure the accuracy of all the information (the “Content”) contained in the publications on our platform. However, Taylor & Francis, our agents, and our licensors make no representations or warranties whatsoever as to the accuracy, completeness, or suitability for any purpose of the Content. Any opinions and views expressed in this publication are the opin...
متن کاملLocal convergence of quasi-Newton methods under metric regularity
We consider quasi-Newton methods for generalized equations in Banach spaces under metric regularity and give a sufficient condition for q-linear convergence. Then we show that the well-known Broyden update satisfies this sufficient condition in Hilbert spaces. We also establish various modes of q-superlinear convergence of the Broyden update under strong metric subregularity, metric regularity ...
متن کاملAn Approach for Analyzing the Global Rate of Convergence of Quasi-Newton and Truncated-Newton Methods
Quasi-Newton and truncated-Newton methods are popular methods in optimization, and are traditionally seen as useful alternatives to the gradient and Newton methods. Throughout the literature, results are found that link quasi-Newton methods to certain first-order methods under various assumptions. We offer a simple proof to show that a range of quasi-Newton methods are first-order methods in th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1970
ISSN: 0025-5718
DOI: 10.2307/2004483